منابع مشابه
PDF Steganography based on Chinese Remainder Theorem
We propose different approaches of PDF files based steganography, essentially based on the Chinese Remainder Theorem. Here, after a cover PDF document has been released from unnecessary characters of ASCII code A0, a secret message is hidden in it using one of the proposed approaches, making it invisible to common PDF readers, and the file is then transmitted through a non-secure communication ...
متن کاملUsing Steganography to hide messages inside PDF files
Steganography focuses on hiding information in such a way that the message is undetectable for outsiders and only appears to the sender and intended recipient. Portable Document Format (PDF) steganography has not received as much attention as other techniques like image steganography because of the lower capacity and text-based file format, which make it harder to hide data. However some approa...
متن کاملSteganalysis of OpenPuff through atomic concatenation of MP4 flags
OpenPuff is recognised as one of the leading tools in video steganography for its capability to securely hide information. This is in contrast to a number of video steganography tools that apply outdated and highly insecure techniques such as EOF data injection. However, even OpenPuff has subtle vulnerabilities that can be easily exploited. In this talk we propose a method to detect the presenc...
متن کاملDismantling Lamarckism
This paper addresses the widespread tendency to describe socio-economic evolution as Lamarckian. The difference between Lamarckian and Darwinian replication is clarified. It is shown that a phenotype-genotype distinction must first be established before we can identify Lamarckian transmission. To qualify as Lamarckian inheritance, acquired properties at the phenotypic level must be encoded in a...
متن کاملNetwork dismantling
We study the network dismantling problem, which consists of determining a minimal set of vertices in which removal leaves the network broken into connected components of subextensive size. For a large class of random graphs, this problem is tightly connected to the decycling problem (the removal of vertices, leaving the graph acyclic). Exploiting this connection and recent works on epidemic spr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digital Investigation
سال: 2018
ISSN: 1742-2876
DOI: 10.1016/j.diin.2018.03.003